incomplete homomorphism

См. также в других словарях:

• Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… …   Wikipedia

• List of mathematics articles (I) — NOTOC Ia IA automorphism ICER Icosagon Icosahedral 120 cell Icosahedral prism Icosahedral symmetry Icosahedron Icosian Calculus Icosian game Icosidodecadodecahedron Icosidodecahedron Icositetrachoric honeycomb Icositruncated dodecadodecahedron… …   Wikipedia

• Model theory — This article is about the mathematical discipline. For the informal notion in other parts of mathematics and science, see Mathematical model. In mathematics, model theory is the study of (classes of) mathematical structures (e.g. groups, fields,… …   Wikipedia

• Orthogonal group — Group theory Group theory …   Wikipedia

• Holonomy — Parallel transport on a sphere depends on the path. Transporting from A → N → B → A yields a vector different from the initial vector. This failure to return to the initial vector is measured by the holonomy of the connection. In differential… …   Wikipedia

• Classification of finite simple groups — Group theory Group theory …   Wikipedia

• Linear map — In mathematics, a linear map, linear mapping, linear transformation, or linear operator (in some contexts also called linear function) is a function between two vector spaces that preserves the operations of vector addition and scalar… …   Wikipedia

• Alfred Tarski — Infobox scientist name = Alfred Tarski caption = birth date = birth date|1901|01|14 birth place = Warsaw, Poland (under Russian rule at the time) death date = death date|1983|10|26 death place = Berkeley, California fields = Mathematics, logic,… …   Wikipedia

• List of conjectures — This is an incomplete list of mathematical conjectures. They are divided into four sections, according to their status in 2007. See also: * Erdős conjecture, which lists conjectures of Paul Erdős and his collaborators * Unsolved problems in… …   Wikipedia

• Power domains — In denotational semantics and domain theory, power domains are domains of nondeterministic and concurrent computations.The idea of power domains for functions is that a nondeterministic function may be described as a deterministic set valued… …   Wikipedia

• Hedetniemi's conjecture — In graph theory, Hedetniemi s conjecture concerns the connection between graph coloring and the tensor product of graphs. This conjecture states that:χ( G × H ) = min {χ( G ), χ( H )}.Here χ( G ) denotes the chromatic number of an undirected… …   Wikipedia